Resolution Based on MRAA for Generalized Distributed Deadlocks
نویسنده
چکیده
A deadlock occurs when there is a cycle of processes waiting for the resources held by others. This deadlock can be resolved only when the cycle is broken i.e. when one of the processes is victimized. None of the previous resolution algorithms choose a victim based on the work done by it before it is aborted. When it aborts, it cancels its pending requests and releases all the resources it had. The aborted process has to restart all the requests to complete its work. The performance of the system deteriorates as a process that has most of its resources allocated is often chosen as a victim. Hence in the proposed algorithm, a victim is chosen based on the Minimum Resource Allocated Already (MRAA) principle. This minimizes the wasted work done and hence the performance of the distributed systems is improved. KeywordsDistributed systems, Resolution, Generalized model, resource deadlocks
منابع مشابه
Efficient algorithms for detection and resolution of distributed deadlocks
We present a simple and efficient distributed algorithm for detecting generalized-deadlocks in distributed systems. Unlike previous algorithms, which are all based on the idea of distributed snapshot, and require multiple rounds of message transfers along the edges of the global wait-€or graph (WFG), the proposed algorithm uses a novel approach that incrementally constructs an “image” of the WF...
متن کاملA Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution
This paper presents a modified priority based probe algorithm for deadlock detection and resolution in distributed database systems. The original priority based probe algorithm was presented by Sinha and Natarajan based on work by Chandy, Misra, and Haas. Various examples are used to show that the original priority based algorithm either fails to detect deadlocks or reports deadlocks which do n...
متن کاملAn Improved Algorithm to Detect Communication Deadlocks in Distributed Systems
This paper presents a new algorithm for the detection and resolution of communication deadlocks in distributed systems. The algorithm is based on some well known concepts for distributed deadlock detection and adds some new features to reduce message-and space complexity. It was implemented on a transputer network and shown to be more eecient than previously published algorithms.
متن کاملComparing factor Bracha -
We present a simple and eecient distributed algorithm for detecting generalized-deadlocks in distributed systems. Unlike previous algorithms, which are all based on the idea of distributed snapshot, and require multiple rounds of message transfers along the edges of the global wait-for graph (WFG), the proposed algorithm uses a novel approach that incrementally constructs an \image" of the WFG ...
متن کاملOn-Line Detection and Resolution of Communication Deadlocks
W e present a new distributed algorithm that detects and resolves communication deadlocks on-line, i .e . , simultaneously detects and resolves deadlock as communication requests are made, at no additional message t r a f i c overhead, and with bounded delay between the occurrence and detection of a deadlock. This i s achieved via a novel technique for detecting knots, which suf ice for the exi...
متن کامل